Codes over tori
نویسنده
چکیده
In this correspondence it is shown how the elements of finite fields when mapped on the surface of a torus can be used for block coding over a three-dimensional signal space. The block codes are useful for data transmission using the recently defined Mannheim distance.
منابع مشابه
Identifying codes of degree 4 Cayley graphs over Abelian groups
In this paper a wide family of identifying codes over regular Cayley graphs of degree four which are built over finite Abelian groups is presented. Some of the codes in this construction are also perfect. The graphs considered include some well-known graphs such as tori, twisted tori and Kronecker products of two cycles. Therefore, the codes can be used for identification in these graphs. Final...
متن کاملProjective Segre codes
Let K = Fq be a finite field. We introduce a family of projective Reed-Mullertype codes called projective Segre codes. Then we study their basic parameters and show that they are direct products of projective Reed-Muller-type codes. It turns out that the direct product of two projective Reed-Muller-type codes is again a projective Reed-Muller-type code. As a consequence we recover some results ...
متن کاملDirect products in projective Segre codes
Let K = Fq be a finite field. We introduce a family of projective Reed-Muller-type codes called projective Segre codes. Using commutative algebra and linear algebra methods, we study their basic parameters and show that they are direct products of projective Reed-Mullertype codes. As a consequence we recover some results on projective Reed-Muller-type codes over the Segre variety and over proje...
متن کاملOmega Polynomial in Polybenzene Multi Tori
The polybenzene units BTX 48, X=A (armchair) and X=Z (zig-zag) dimerize forming “eclipsed” isomers, the oligomers of which form structures of five-fold symmetry, called multi-tori. Multi-tori can be designed by appropriate map operations. The genus of multi-tori was calculated from the number of tetrapodal units they consist. A description, in terms of Omega polynomial, of the two linearly peri...
متن کاملNew Constructions for De Bruijn Tori
A De Bruijn torus is a periodic d−dimensional k−ary array such that each n1 × · · · × nd k−ary array appears exactly once with the same period. We describe two new methods of constructing such arrays. The first is a type of product that constructs a k1k2−ary torus from a k1−ary torus and a k2−ary torus. The second uses a decomposition of a d-dimensional torus to produce a d + 1 dimensional toru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 43 شماره
صفحات -
تاریخ انتشار 1997